منابع مشابه
Regular stochastic Petri nets
An extension of regular nets, a class of coloredd nets, to a stochastic model is proposed. We show that the symmetries in this class of nets make it pos sible to developp a performance evaluation by constructingg only a graph of symbolic markings, which ver tices are classes of states, insteadd of the whole reachability graph. Usingg algebraic techniques, we prove that all the states in a class...
متن کاملPetri Nets and Regular Processes
We consider the following problems: (a) Given a labelled Petri net and a finite automaton, are they equivalent? (b) Given a labelled Petri net, is it equivalent to some (unspecified) finite automaton? These questions are studied within the framework of trace and bisimulation equivalences, in both their strong and weak versions. (In the weak version a special action—likened to an "-move in autom...
متن کاملStochastic Petri Nets Sensitivity to Token Scheduling Policies
Stochastic Petri Nets and their generalizations are powerful formalisms for the specification of stochastic processes. In their original definition they do not provide any specification for the token extraction order applied by a transition to its input places, however this aspect may be relevant if timed transitions are interpreted as servers and tokens as customers, so that the extraction ord...
متن کاملThe Individual and Collective Token Interpretations of Petri Nets
Starting from the opinion that the standard firing rule of Petri nets embodies the collective token interpretation of nets rather than their individual token interpretation, I propose a new firing rule that embodies the latter. Also variants of both firing rules for the selfsequential interpretation of nets are studied. Using these rules, I express the four computational interpretations of Petr...
متن کاملDense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions). We consider the following verification problems for TPNs. (i) Zenoness: whether there exists a zeno-computation from a given marking, i.e., an infinite compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2020
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0802/0019